Compression property of hierarchical pyramid lattice
نویسندگان
چکیده
منابع مشابه
Fractal-based hierarchical mip-pyramid texture compression
As the level of realism of computer generated images increases with the number and resolution of textures, we are faced with the problem of limited hardware resources. Additionally, the filtering methods require multiple accesses and extra memory space for the texture representation, thus severely reducing the memory space and bandwidth, the most common example being mip-mapping technique. We p...
متن کاملFingerprint compression using a piecewise-uniform pyramid lattice vector quantization
A new compression algorithm for ngerprint images is introduced. Using Lattice Vector Quantization (LVQ), a technique for determining the largest radius of the Lattice and its scaling factor is presented. The design is based on obtaining the smallest possible Expected Total Distortion (ETD) measure, using a given bit budget, while using the smallest codebook size. In the proposed Piecewise-Unifo...
متن کاملThe 3*-connected property of pyramid networks
A k-container C(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) of G is a k-container if it contains all the vertices of G. A graph G is k-connected if there exists a k-container between any two distinct vertices in G. Let κ(G) be the connectivity of G. A graph G is superconnected if G is i-connected for all 1 ≤ i ≤ κ(G). The pyramid network is one of the i...
متن کاملA novel fingerprint image compression technique using wavelets packets and pyramid lattice vector quantization
A novel compression algorithm for fingerprint images is introduced. Using wavelet packets and lattice vector quantization , a new vector quantization scheme based on an accurate model for the distribution of the wavelet coefficients is presented. The model is based on the generalized Gaussian distribution. We also discuss a new method for determining the largest radius of the lattice used and i...
متن کاملImage Data Compression with the Laplacian Pyramid *
Pixel to pixel correlations are first removed by subtracting a low-pass filtered copy of the image from the image itself. The result is a net data compression since the difference, or error, image has low variance, and the low-pass filtered image may be represented at reduced sample density. Further data compression is achieved by quantizing the difference image and repeating the encoding proce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2020
ISSN: 1757-899X
DOI: 10.1088/1757-899x/738/1/012031